Bias and No Free Lunch in Formal Measures of Intelligence
نویسنده
چکیده
This paper shows that a constraint on universal Turing machines is necessary for Legg's and Hutter's formal measure of intelligence to be unbiased. Their measure, defined in terms of Turing machines, is adapted to finite state machines. A No Free Lunch result is proved for the finite version of the measure.
منابع مشابه
Distribution of Environments in Formal Measures of Intelligence: Extended Version
This paper shows that a constraint on universal Turing machines is necessary for Legg's and Hutter's formal measure of intelligence to be unbiased. Their measure, defined in terms of Turing machines, is adapted to finite state machines. A No Free Lunch result is proved for the finite version of the measure, and this motivates a less
متن کاملEvolutionary Computation EEL 4818H
As early as the very beginnings of the science of computation, in the times of Charles Babbage and his “analytical engine”, search has been recognized as an important conceptual tool for problem solving. Later, in the initial stages of modern computational theory and artificial intelligence, Alan Turing proposed various kinds of search as a means to achieve machine intelligence. Since then, sea...
متن کاملRemarks on a recent paper on the "no free lunch" theorems
This letter discusses the recent paper Some technical remarks on the proof of the No Free Lunch the orem In that paper some technical issues related to the formal proof of the No Free Lunch NFL theorem for search were given As a result of a discussion among the authors this letter explores the issues raised in that paper more thoroughly This includes the presentation of a simpler version of the...
متن کاملNo-Free-Lunch and Bayesian Optimality
We take a Bayesian approach to the issues of bias, meta bias, transfer, overfit, and No-Free-Lunch in the context of supervised learning. If we accept certain relationships between the function class, on training set data, and off training set data, then a graphical model can be created that represents the supervised learning problem. This graphical model dictates a specific algorithm which wil...
متن کاملThe No Free Lunch Theorem Disproved by Counterexample: A Justification for Regrouing
After deriving the particle swarm equations from basic physics, this paper shows by contradiction that NFL Theorem 1, and consequently Theorems 2 and 3, are irrelevant to continuous optimization. As the discrete nature of matter at its most fundamental level is generally irrelevant from the broader classical perspective, so to is the discrete nature of an optimization problem at its most fundam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Artificial General Intelligence
دوره 1 شماره
صفحات -
تاریخ انتشار 2009